﻿#define _CRT_SECURE_NO_WARNINGS
#pragma once

#include "sort.h"
#include "stack.h"

// 测试排序的性能对⽐
void TestOP()
{
	srand((unsigned)time(0));
	const int N = 100000;
	int* a1 = (int*)malloc(sizeof(int) * N);     //开辟同样空间大小
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);

	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();              //都随机放入相同的数
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
	}

	int begin1 = clock();           //记录调用函数前后的时间          //注意使用release 去运行，可以减少编译的时间
	InsertSort(a1, N);
	int end1 = clock();

	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();

	int begin3 = clock();
	SelectSort(a3, N);  
	int end3 = clock();

	int begin4 = clock();
	HeapSort(a4, N);          //非常的强！！！
	int end4 = clock();

	int begin5 = clock();
	//QuickSort(a5, 0, N - 1);     //快速排序算法，无论是什么找基准值的函数，当面对有序数组时，都是趋近于On2
	QuickSortNonR(a5, 0, N - 1);    //使用迭代的方式实现，借助数据结构栈，当然其它数据结构也是可以的
	int end5 = clock();

	int begin6 = clock();
	MergeSort(a6, N);
	int end6 = clock();

	int begin7 = clock();
	BubbleSort(a7, N);
	int end7 = clock();

	printf("InsertSort:%d\n", end1 - begin1);         //时间单位为毫秒，1s = 1k ms 
	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);
	printf("BubbleSort:%d\n", end7 - begin7);

	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
	free(a7);
}

void Print(int* arr,int sz)
{
	for (int i = 0; i < sz; i++)
	{
		printf("%d ", arr[i]);
	}
	printf("\n");
}

void test01()
{
	int arr[10] = { 5,6,3,4,2,1,7,9,8,10 };
	int arr2[10] = { 42,17, 89, 63, 5, 31, 74, 28, 50, 96 };
	int arr3[10] = { 8,8,8,8,8,8,8,8,8,8 };
	int arr4[4] = { 4,3,2,1 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	int sz4 = sizeof(arr4) / sizeof(arr4[0]);

	/*InsertSort(arr2, sz); 
	Print(arr2,sz); */

	/*ShellSort(arr, sz);
	Print(arr, sz);*/

	/*SelectSort(arr3, sz);
	Print(arr3, sz);*/

	
	//QuickSort(arr4, 0, 3);
	//Print(arr4, sz4);

	//QuickSortNonR(arr4, 0, 3);
	//Print(arr4, sz4);

	MergeSort(arr2, sz);
	Print(arr2, sz);
}

int main()
{
	//test01();
	TestOP();
	return 0;
}